Generalized resolution for 0?1 linear inequalities
نویسندگان
چکیده
منابع مشابه
Improved Lower Bounds for Resolution over Linear Inequalities
We continue a study initiated by Kraj́ıček of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kraj́ıček proved in [1] an exponential lower bound of the form: exp(n) MO(W log 2 n) , where M is the maximal absolute value of coefficients in a given proof and W is the maximal clause width. In this paper we improve this lower bound f...
متن کاملImproved Lower Bounds for Tree-Like Resolution over Linear Inequalities
We continue a study initiated by Kraj́ıček of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kraj́ıček proved in [1] an exponential lower bound of the form: exp(n) MO(W log2 n) , where M is the maximal absolute value of coefficients in a given proof and W is the maximal clause width. In this paper we improve this lower bound. F...
متن کاملGeneralized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
متن کاملSome Weighted Integral Inequalities for Generalized Conformable Fractional Calculus
In this paper, we have obtained weighted versions of Ostrowski, Čebysev and Grüss type inequalities for conformable fractional integrals which is given by Katugompola. By using the Katugampola definition for conformable calculus, the present study confirms previous findings and contributes additional evidence that provide the bounds for more general functions.
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 1992
ISSN: 1012-2443,1573-7470
DOI: 10.1007/bf01531033